Solving Sparse Symmetric Path Problems on a Network of Computers
نویسندگان
چکیده
Path problems can be solved in many ways, by sequential, parallel, general or specialized algorithms 2, 4, 6 . In 8 we have proposed a fairly general distributed algorithm which can be implemented on a network of computers and can be applied to all types of path problems. In 7 we have also studied optimized versions of the same algorithm that are faster but applicable only to certain classes of problems, e.g. symmetric or acyclic or sparse.
منابع مشابه
An inexact interior point method for L 1-regularized sparse covariance selection
Sparse covariance selection problems can be formulated as log-determinant (log-det ) semidefinite programming (SDP) problems with large numbers of linear constraints. Standard primal-dual interior-point methods that are based on solving the Schur complement equation would encounter severe computational bottlenecks if they are applied to solve these SDPs. In this paper, we consider a customized ...
متن کاملSOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملRestricted Additive Schwarz Preconditioners with Harmonic Overlap for Symmetric Positive Definite Linear Systems
A restricted additive Schwarz (RAS) preconditioning technique was introduced recently for solving general nonsymmetric sparse linear systems. In this paper, we provide one-level and two-level extensions of RAS for symmetric positive definite problems using the so-called harmonic overlaps (RASHO). Both RAS and RASHO outperform their counterparts of the classical additive Schwarz variants (AS). T...
متن کاملOptimal Path Diagnosis by Genetic Algorithm for NoCs
Nowadays Network-on-Chips is used instead of System-on-Chips for better performance. This paper presents a new algorithm to find a shorter path, and shows that genetic algorithm is a potential technique for solving routing problem for mesh topology in on-chip-network.
متن کامل